A Survey of Stochastic Games with Limsup and Liminf Objectives

نویسندگان

  • Krishnendu Chatterjee
  • Laurent Doyen
  • Thomas A. Henzinger
چکیده

A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We survey stochastic games with limsup and liminf objectives. A real-valued reward is assigned to each state, and the value of an infinite path is the limsup (resp. liminf) of all rewards along the path. The value of a stochastic game is the maximal expected value of an infinite path that can be achieved by resolving the decisions of the first player. We present the complexity of computing values of stochastic games and their subclasses, and the complexity of optimal strategies in such games.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Systems with LimSup and LimInf Objectives

We give polynomial-time algorithms for computing the values of Markov decision processes (MDPs) with limsup and liminf objectives. A real-valued reward is assigned to each state, and the value of an infinite path in the MDP is the limsup (resp. liminf) of all rewards along the path. The value of an MDP is the maximal expected value of an infinite path that can be achieved by resolving the decis...

متن کامل

On the complexity of heterogeneous multidimensional quantitative games

In this paper, we study two-player zero-sum turn-based games played on a finite multidimensional weighted graph. In recent papers all dimensions use the same measure, whereas here we allow to combine different measures. Such heterogeneous multidimensional quantitative games provide a general and natural model for the study of reactive system synthesis. We focus on classical measures like the In...

متن کامل

The Multiple Dimensions of Mean-Payoff Games

Outline We consider quantitative game models for the design of reactive systems working in resource-constrained environment. The game is played on a finite weighted graph where some resource (e.g., battery) can be consumed or recharged along the edges of the graph. In mean-payoff games, the resource usage is computed as the long-run average resource consumption. In energy games, the resource us...

متن کامل

Oscillations Of Functional Differential Equations

Consider the rst order delay diierential equation x 0 (t) + p(t)x(t ?) = 0; > 0; t t 0 ; () and its discrete analogue Oscillation criteria are established for () in the case where 0 < liminf t!1 R t t? p (s) 1 e and limsup t!1 R t t? p(s)ds < 1, and for () 0 when liminf n!1 n?1 P i=n?k p i k k+1 k+1 and limsup n!1 n P i=n?k p i < 1. reziume. naSromSi ganxil u l ia pir vel i rigis dagvianebu l a...

متن کامل

Games through Nested Fixpoints

In this paper we consider two-player zero-sum payoff games on finite graphs, both in the deterministic as well as in the stochastic setting. In the deterministic setting, we consider total-payoff games which have been introduced as a refinement of mean-payoff games [18, 10]. In the stochastic setting, our class is a turn-based variant of liminf-payoff games [15, 16, 4]. In both settings, we pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009